Solving High Dimensional and Complex Non-convex Programming Based on Improved Quantum Artificial Fish Algorithm
نویسندگان
چکیده
An improved quantum artificial fish swarm algorithm is proposed in this paper. Based on that quantum computing have exponential acceleration for heuristic algorithm, by examining eight most recent patents and some literatures in the area of artificial fish swarm algorithm and quantum computing. The new algorithm uses qubits to code artificial fish and quantum revolving gate, preying behavior, following behavior and variation of quantum artificial fish to update the artificial fish for searching for optimal value. Then, apply the new algorithm, the basic artificial fish swarm algorithm and the global edition artificial fish swarm algorithm to the simulation experiment high dimensional and complex non-convex programming respectively. The simulation results show that the improved algorithm can escape from the local extremum effectively, and has higher convergence speed and precision.
منابع مشابه
AN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM
This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...
متن کاملImproved Quantum Artificial Fish Algorithm Application to Distributed Network Considering Distributed Generation
An improved quantum artificial fish swarm algorithm (IQAFSA) for solving distributed network programming considering distributed generation is proposed in this work. The IQAFSA based on quantum computing which has exponential acceleration for heuristic algorithm uses quantum bits to code artificial fish and quantum revolving gate, preying behavior, and following behavior and variation of quantu...
متن کاملA Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملOn the optimization of Dombi non-linear programming
Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization problem in which the constraints are defined as fuzzy relational equations (FRE) with the Dombi...
متن کاملPresentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...
متن کامل